Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Vehicular ad-hoc network greedy routing algorithm based on path exploration
TANG Xingfeng, XU Qingqin, MA Shiwei
Journal of Computer Applications    2020, 40 (6): 1738-1744.   DOI: 10.11772/j.issn.1001-9081.2019101832
Abstract313)      PDF (867KB)(292)       Save
In order to improve the transmission efficiency of information between vehicles in the city and realize the information sharing between vehicles, aiming at the problem that the current multi-hop unicast routing algorithm based on geographical location forwarding in the Vehicular Ad-hoc NETwork (VANET) does not consider the specificity of the urban scene and cannot adapt to the high dynamicity of vehicles in the city, so that the data packets between vehicles may spread on the wrong path, resulting in high packet loss rate and long delay, a new greedy routing algorithm based on path exploration was proposed. Firstly, taken the data packet transmission delay as the standard, artificial bee colony algorithm was used to explore multiple routing paths planned by the digital map. Then, the multi-hop forwarding method of data packets between vehicles was optimized. Simulation results show that, compared with Greedy Perimeter Stateless Routing (GPSR) protocol and Maxduration-Minangle GPSR (MM-GPSR) improved algorithm, in the best case, the data packet arrival rate of the proposed algorithm increases by 13.81% and 9.64% respectively, and the average data packet end-to-end delay of the proposed algorithm decreases by 61.91% and 27.28% respectively.
Reference | Related Articles | Metrics
Real-time defence against dynamic host configuration protocol flood attack in software defined network
ZOU Chengming, LIU Panwen, TANG Xing
Journal of Computer Applications    2019, 39 (4): 1066-1072.   DOI: 10.11772/j.issn.1001-9081.2018091852
Abstract334)      PDF (1082KB)(248)       Save
In Software Defined Network (SDN), Dynamic Host Configuration Protocol (DHCP) flood attack packets can actively enter the controller in reactive mode, which causes a huge hazard to SDN. Aiming at the promblem that the traditional defense method against DHCP flood attack cannot keep the SDN network from control link blocking caused by the attack, a Dynamic Defense Mechanism (DDM) against DHCP flood attacks was proposed. DDM is composed of a detection model and mitigation model. In the detection model, different from the static threshold detection method, a dynamic peak estimation model was constructed by two key parameters - DHCP average traffic seed and IP pool surplus to evaluate whether the ports were attacked. If the ports were attacked, the mitigation model would be informed. In the mitigation model, the IP pool cleaning was performed based on the response character of Address Resolution Protocol (ARP), and an interval interception mechanism was designed to intercept the attack source, mitigating the congestion and minimizing the impact on users during interception. Simulation experimental results show that the detection error of DDM is averagely 18.75%, lower than that of the static threshold detection. The DDM mitigation model can effectively intercept traffic and reduce the waiting time for users to access the network during the interception by an average of 81.45%.
Reference | Related Articles | Metrics